#include"Sort.h"
vector<int> randVector(int begin, int end, int length) {
	srand(time(0));
	vector<int>v;
	v.resize(length);
	for (int i = 0; i < length; i++) {
		float ran = rand() * 1.0 / RAND_MAX;
		int x = round(begin + (end - begin) * ran);
		v[i] = x;
	}
	return v;
}
void printVector(vector<int>& v) {
	for (int i = 0; i < v.size(); i++)
		cout << v[i] << ' ';
	cout << endl;
}
void seleSort(vector<int>& v) {
	pair< int, int> minNum;
	for (int i = 0; i < v.size(); i++) {
		minNum = make_pair(v[i], i);
		for (int j = i; j < v.size(); j++) {
			if (minNum.first > v[j]) {
				minNum.first = v[j];
				minNum.second = j;
			}
		}
		swap(v[i], v[minNum.second]);
	}
}